/*
 * Copyright (C) 2015 soud
 *
 * Permission is hereby granted, free of charge, to any person obtaining
 * a copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included
 * in all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
 * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
 * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE
 * OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 */

#include "erupt.h"
#include "stack.h"

void stack_push(stack_t **stack, token_t value)
{
        stack_t *tmp = smalloc(sizeof(stack_t));

        tmp->value = value;
        tmp->next = *stack;

        *stack = tmp;
}

token_t stack_pop(stack_t **stack)
{
        stack_t *tmp = *stack;
        token_t val = tmp->value;

        *stack = tmp->next;

        return val;
}

token_t stack_top(stack_t **stack)
{
        return (*stack)->value;
}

void stack_destroy(stack_t *stack)
{
        if (!stack)
                return;

        while (stack_size(stack))
                stack_pop(&stack);
}

void stack_dump(stack_t *stack)
{
        if (!stack)
                return;

        while (stack->next) {
                printf("%s ", stack->value.value);
                stack = stack->next;
        }

        printf("\n");
}

size_t stack_size(stack_t *stack)
{
        size_t size = 0;

        while (stack->next) {
                ++size;
                stack = stack->next;
        }

        return size;
}
